0.11/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.11 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.11/0.32 % Computer : n029.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 1920 0.11/0.32 % WCLimit : 240 0.11/0.32 % DateTime : Wed Jul 30 07:09:04 EDT 2025 0.11/0.32 % CPUTime : 0.20/0.46 Running higher-order theorem proving 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.phAveQ8842/E---3.1_7919.p 0.20/0.53 # Version: 3.0.0-ho 0.20/0.53 # Preprocessing class: HSLMSMSSLLLCHSA. 0.20/0.53 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.53 # Starting lpo1_fix with 720s (3) cores 0.20/0.53 # Starting full_lambda_9 with 240s (1) cores 0.20/0.53 # Starting almost_fo_4 with 240s (1) cores 0.20/0.53 # Starting new_ho_9 with 240s (1) cores 0.20/0.53 # Starting pre_casc_4 with 240s (1) cores 0.20/0.53 # Starting ho_unfolding_6 with 240s (1) cores 0.20/0.53 # pre_casc_4 with pid 8002 completed with status 0 0.20/0.53 # Result found by pre_casc_4 0.20/0.53 # Preprocessing class: HSLMSMSSLLLCHSA. 0.20/0.53 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.53 # Starting lpo1_fix with 720s (3) cores 0.20/0.53 # Starting full_lambda_9 with 240s (1) cores 0.20/0.53 # Starting almost_fo_4 with 240s (1) cores 0.20/0.53 # Starting new_ho_9 with 240s (1) cores 0.20/0.53 # Starting pre_casc_4 with 240s (1) cores 0.20/0.53 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.20/0.53 # Search class: HGUSM-FFMM31-DHSMMSBN 0.20/0.53 # partial match(3): HGHSM-FFMM31-SHSSMSBN 0.20/0.53 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.53 # Starting new_ho_10 with 130s (1) cores 0.20/0.53 # new_ho_10 with pid 8004 completed with status 0 0.20/0.53 # Result found by new_ho_10 0.20/0.53 # Preprocessing class: HSLMSMSSLLLCHSA. 0.20/0.53 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.53 # Starting lpo1_fix with 720s (3) cores 0.20/0.53 # Starting full_lambda_9 with 240s (1) cores 0.20/0.53 # Starting almost_fo_4 with 240s (1) cores 0.20/0.53 # Starting new_ho_9 with 240s (1) cores 0.20/0.53 # Starting pre_casc_4 with 240s (1) cores 0.20/0.53 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.20/0.53 # Search class: HGUSM-FFMM31-DHSMMSBN 0.20/0.53 # partial match(3): HGHSM-FFMM31-SHSSMSBN 0.20/0.53 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.53 # Starting new_ho_10 with 130s (1) cores 0.20/0.53 # Preprocessing time : 0.005 s 0.20/0.53 # Presaturation interreduction done 0.20/0.53 0.20/0.53 # Proof found! 0.20/0.53 # SZS status Theorem 0.20/0.53 # SZS output start CNFRefutation 0.20/0.53 thf(decl_23, type, is_of: $i > ($i > $o) > $o). 0.20/0.53 thf(decl_24, type, all_of: ($i > $o) > ($i > $o) > $o). 0.20/0.53 thf(decl_26, type, in: $i > $i > $o). 0.20/0.53 thf(decl_48, type, ordsucc: $i > $i). 0.20/0.53 thf(decl_78, type, e_is: $i > $i > $i > $o). 0.20/0.53 thf(decl_124, type, nat: $i). 0.20/0.53 thf(decl_125, type, n_is: $i > $i > $o). 0.20/0.53 thf(decl_131, type, n_1: $i). 0.20/0.53 thf(decl_143, type, n_pl: $i > $i > $i). 0.20/0.53 thf(decl_144, type, esk1_0: $i). 0.20/0.53 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.phAveQ8842/E---3.1_7919.p', def_all_of)). 0.20/0.53 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.phAveQ8842/E---3.1_7919.p', def_is_of)). 0.20/0.53 thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.phAveQ8842/E---3.1_7919.p', def_e_is)). 0.20/0.53 thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.phAveQ8842/E---3.1_7919.p', def_n_is)). 0.20/0.53 thf(satz4g, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((n_is @ (ordsucc @ X1) @ (n_pl @ n_1 @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.phAveQ8842/E---3.1_7919.p', satz4g)). 0.20/0.53 thf(satz4c, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((n_is @ (n_pl @ n_1 @ X1) @ (ordsucc @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.phAveQ8842/E---3.1_7919.p', satz4c)). 0.20/0.53 thf(c_0_6, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])). 0.20/0.53 thf(c_0_7, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 0.20/0.53 thf(c_0_8, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])). 0.20/0.53 thf(c_0_9, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_6, c_0_7])). 0.20/0.53 thf(c_0_10, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_8])). 0.20/0.53 thf(c_0_11, negated_conjecture, ~(![X279:$i]:(((in @ X279 @ nat)=>((ordsucc @ X279)=(n_pl @ n_1 @ X279))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz4g])]), c_0_9]), c_0_10])). 0.20/0.53 thf(c_0_12, plain, ![X284:$i]:(((in @ X284 @ nat)=>((n_pl @ n_1 @ X284)=(ordsucc @ X284)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4c]), c_0_9]), c_0_10])). 0.20/0.53 thf(c_0_13, negated_conjecture, ((in @ esk1_0 @ nat)&((ordsucc @ esk1_0)!=(n_pl @ n_1 @ esk1_0))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])). 0.20/0.53 thf(c_0_14, plain, ![X348:$i]:((~(in @ X348 @ nat)|((n_pl @ n_1 @ X348)=(ordsucc @ X348)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])). 0.20/0.53 thf(c_0_15, negated_conjecture, ((ordsucc @ esk1_0)!=(n_pl @ n_1 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.53 thf(c_0_16, plain, ![X1:$i]:((((n_pl @ n_1 @ X1)=(ordsucc @ X1))|~((in @ X1 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.53 thf(c_0_17, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.53 thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])]), ['proof']). 0.20/0.53 # SZS output end CNFRefutation 0.20/0.53 # Parsed axioms : 313 0.20/0.53 # Removed by relevancy pruning/SinE : 244 0.20/0.53 # Initial clauses : 108 0.20/0.53 # Removed in clause preprocessing : 3 0.20/0.53 # Initial clauses in saturation : 105 0.20/0.53 # Processed clauses : 123 0.20/0.53 # ...of these trivial : 4 0.20/0.53 # ...subsumed : 6 0.20/0.53 # ...remaining for further processing : 113 0.20/0.53 # Other redundant clauses eliminated : 2 0.20/0.53 # Clauses deleted for lack of memory : 0 0.20/0.53 # Backward-subsumed : 0 0.20/0.53 # Backward-rewritten : 0 0.20/0.53 # Generated clauses : 7 0.20/0.53 # ...of the previous two non-redundant : 4 0.20/0.53 # ...aggressively subsumed : 0 0.20/0.53 # Contextual simplify-reflections : 0 0.20/0.53 # Paramodulations : 4 0.20/0.53 # Factorizations : 0 0.20/0.53 # NegExts : 0 0.20/0.53 # Equation resolutions : 2 0.20/0.53 # Disequality decompositions : 0 0.20/0.53 # Total rewrite steps : 16 0.20/0.53 # ...of those cached : 5 0.20/0.53 # Propositional unsat checks : 0 0.20/0.53 # Propositional check models : 0 0.20/0.53 # Propositional check unsatisfiable : 0 0.20/0.53 # Propositional clauses : 0 0.20/0.53 # Propositional clauses after purity: 0 0.20/0.53 # Propositional unsat core size : 0 0.20/0.53 # Propositional preprocessing time : 0.000 0.20/0.53 # Propositional encoding time : 0.000 0.20/0.53 # Propositional solver time : 0.000 0.20/0.53 # Success case prop preproc time : 0.000 0.20/0.53 # Success case prop encoding time : 0.000 0.20/0.53 # Success case prop solver time : 0.000 0.20/0.53 # Current number of processed clauses : 17 0.20/0.53 # Positive orientable unit clauses : 7 0.20/0.53 # Positive unorientable unit clauses: 0 0.20/0.53 # Negative unit clauses : 5 0.20/0.53 # Non-unit-clauses : 5 0.20/0.53 # Current number of unprocessed clauses: 81 0.20/0.53 # ...number of literals in the above : 244 0.20/0.53 # Current number of archived formulas : 0 0.20/0.53 # Current number of archived clauses : 95 0.20/0.53 # Clause-clause subsumption calls (NU) : 690 0.20/0.53 # Rec. Clause-clause subsumption calls : 238 0.20/0.53 # Non-unit clause-clause subsumptions : 6 0.20/0.53 # Unit Clause-clause subsumption calls : 10 0.20/0.53 # Rewrite failures with RHS unbound : 0 0.20/0.53 # BW rewrite match attempts : 1 0.20/0.53 # BW rewrite match successes : 0 0.20/0.53 # Condensation attempts : 123 0.20/0.53 # Condensation successes : 0 0.20/0.53 # Termbank termtop insertions : 15183 0.20/0.53 # Search garbage collected termcells : 4538 0.20/0.53 0.20/0.53 # ------------------------------------------------- 0.20/0.53 # User time : 0.026 s 0.20/0.53 # System time : 0.001 s 0.20/0.53 # Total time : 0.027 s 0.20/0.53 # Maximum resident set size: 3000 pages 0.20/0.54 0.20/0.54 # ------------------------------------------------- 0.20/0.54 # User time : 0.035 s 0.20/0.54 # System time : 0.002 s 0.20/0.54 # Total time : 0.037 s 0.20/0.54 # Maximum resident set size: 2148 pages 0.20/0.54 % E exiting 0.20/0.54 % E exiting 0.20/0.54 EOF